Constraint Solving for Interpolation

نویسندگان

  • Andrey Rybalchenko
  • Viorica Sofronie-Stokkermans
چکیده

Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good’ and ‘bad’ states. The existing algorithms for interpolant generation are proof-based: They require explicit construction of proofs, from which interpolants can be computed. Construction of such proofs is a difficult task. We propose an algorithm for the generation of interpolants for the combined theory of linear arithmetic and uninterpreted function symbols that does not require a priori constructed proofs to derive interpolants. It uses a reduction of the problem to constraint solving in linear arithmetic, which allows application of existing highly optimized Linear Programming solvers in black-box fashion. We provide experimental evidence of the practical applicability of our algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Camera Interpolation using Screen-Space Constraints

This paper demonstrates the use of image-space constraints for key frame interpolation. Interpolating in image-space results in sequences with predictable and controlable image trajectories and projected size for selected objects, particularly in cases where the desired center of rotation is not fixed or when the key frames contain perspective distortion changes. Additionally, we provide the us...

متن کامل

WUCSE-2006-28: Smooth Key-framing using the Image Plane

This paper demonstrates the use of image-space constraints for key frame interpolation. Interpolating in image-space results in sequences with predictable and controlable image trajectories and projected size for selected objects, particularly in cases where the desired center of rotation is not fixed or when the key frames contain perspective distortion changes. Additionally, we provide the us...

متن کامل

Application of ‎F‎uzzy Bicubic Splines Interpolation for Solving ‎T‎wo-Dimensional Linear Fuzzy Fredholm Integral ‎Equations‎‎

‎In this paper‎, ‎firstly‎, ‎we review approximation of fuzzy functions‎ ‎by fuzzy bicubic splines interpolation and present a new approach‎ ‎based on the two-dimensional fuzzy splines interpolation and‎ ‎iterative method to approximate the solution of two-dimensional‎ ‎linear fuzzy Fredholm integral equation (2DLFFIE)‎. ‎Also‎, ‎we prove‎ ‎convergence analysis and numerical stability analysis ...

متن کامل

SOLVING INTEGRO-DIFFERENTIAL EQUATION BY USING B- SPLINE INTERPOLATION

In this paper a numerical technique based on the B-spline method is presented for the solution of Fredholm integro-differential equations. To illustrate the efficiency of the method some examples are introduced and the results are compared with the exact solution.  

متن کامل

Solving Recursion-Free Horn Clauses over LI+UIF

Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively automated using abstraction and refinement schemes that rely on spurious counterexamples for abstraction discovery. The analysis of counterexamples can be automated by a series of interpolation queries, or, alternatively, as a constraint solving query expressed by a set of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007